Inference in Multiply Sectioned Bayesian Networks with Extended Shafer-Shenoy and Lazy Propagation
نویسندگان
چکیده
As Bayesian networks are applied to larger and more complex problem domains, search for flexible modeling and more efficient in ference methods is an ongoing effort. Mul tiply sectioned Bayesian networks (MSBNs) extend the HUGIN inference for Bayesian networks into a coherent framework for flexible modeling and distributed inference. Lazy propagation extends the Shafer-Shenoy and HUG IN inference methods with reduced space complexity. We apply the Shafer-Shenoy and lazy propa gation to inference in MSBNs. The combina tion of the MSBN framework and lazy propa gation provides a better framework for mod eling and inference in very large domains. It retains the modeling flexibility of MSBNs and reduces the runtime space complexity, allow ing exact inference in much larger domains given the same computational resources.
منابع مشابه
Inference in Multiply Sectioned Bayesian
As Bayesian networks are applied to larger and more complex problem domains, search for exible modeling and more eecient inference methods is an ongoing eeort. Multiply sectioned Bayesian networks (MSBNs) extend the HUGIN inference for Bayesian networks into a coherent framework for exible modeling and distributed inference. Lazy propagation extends the Shafer-Shenoy and HUGIN inference methods...
متن کاملLazy Propagation in Junction Trees D Lazy Propagation in Junction Trees
The eeciency of algorithms using secondary structures for probabilistic inference in Bayesian networks can be improved by exploiting independence relations induced by evidence and the direction of the links in the original network. In this paper we present an algorithm that exploits the independences relations induced by evidence and the direction of the links in the original network to reduce ...
متن کاملInference in Multiply Sectioned Bayesian Networks with Lazy Propagation and Linked Junction Forests
Lazy propagation reduces the space complexity. MSBNs extend BNs to multiagent. To combine the benefits of the two, a framework was proposed earlier to apply lazy propagation to inference in MSBNs. We propose an alternative framework with a simpler compiled structure.
متن کاملLazy Propagation in Junction Trees
The efficiency of algorithms using sec ondary structures for probabilistic inference in Bayesian networks can be improved by ex ploiting independence relations induced by evidence and the direction of the links in the original network. In this paper we present an algorithm that on-line exploits indepen dence relations induced by evidence and the direction of the links in the original network...
متن کاملLAZY Propagation: A Junction Tree Inference Algorithm Based on Lazy Evaluation
In this paper we present a junction tree based inference architecture exploiting the structure of the original Bayesian network and independence relations induced by evidence to improve the efficiency of inference. The efficiency improvements are obtained by maintaining a multiplicative decomposition of clique and separator potentials. Maintaining a multiplicative decomposition of clique and se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999